#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 110;
int v[N], w[N], s[N];
int f[N];
int n, m;
int main()
{
	int t;
	cin >> t;
	while (t--) {
		cin >> m >> n;
		memset(f, 0, sizeof(f));
		for (int i = 1; i <= n; i++) {
			cin >> v[i] >> w[i] >> s[i];
		}
		for (int i = 1; i <= n; i++) {
			for (int j = m; j >= v[i]; j--) {
				for (int k = 0; k * v[i] <= j && k <= s[i]; k++) {
					f[j] = max(f[j], f[j - k * v[i]] + k * w[i]);
				}
			}
		}
		cout << f[m] << endl;
	}
	return 0;
}